package likou;

/**
 * @Info:
 * @Author: 唐小尊
 * @Date: 2020/4/23  22:29
 */
public class _8_11 {
    long MOD = 1000000007;
    public static void main(String[] args) {

    }

    int waysToChange(int n) {
        int res = 0;
        for(int n25 = 0; n25 <= n/25; n25++)
        {
            int temp = n - n25*25;
            res = (int) ((res+(((temp/5+1 + (long)(temp%10)/5+1)*(temp/10+1))/2))%MOD);
        }
        return res;
    }
}
